Filtros : "Prata, Bruno de Athayde" Limpar

Filtros



Refine with date range


  • Source: Results in Control and Optimization. Unidade: EESC

    Subjects: PROGRAMAÇÃO DA PRODUÇÃO, INTELIGÊNCIA ARTIFICIAL, BIBLIOMETRIA

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      PRATA, Bruno de Athayde e ABREU, Levi Ribeiro de e NAGANO, Marcelo Seido. Applications of constraint programming in production scheduling problems: a descriptive bibliometric analysis. Results in Control and Optimization, v. 14, p. 1-17, 2024Tradução . . Disponível em: http://dx.doi.org/10.1016/j.rico.2023.100350. Acesso em: 28 abr. 2024.
    • APA

      Prata, B. de A., Abreu, L. R. de, & Nagano, M. S. (2024). Applications of constraint programming in production scheduling problems: a descriptive bibliometric analysis. Results in Control and Optimization, 14, 1-17. doi:10.1016/j.rico.2023.100350
    • NLM

      Prata B de A, Abreu LR de, Nagano MS. Applications of constraint programming in production scheduling problems: a descriptive bibliometric analysis [Internet]. Results in Control and Optimization. 2024 ; 14 1-17.[citado 2024 abr. 28 ] Available from: http://dx.doi.org/10.1016/j.rico.2023.100350
    • Vancouver

      Prata B de A, Abreu LR de, Nagano MS. Applications of constraint programming in production scheduling problems: a descriptive bibliometric analysis [Internet]. Results in Control and Optimization. 2024 ; 14 1-17.[citado 2024 abr. 28 ] Available from: http://dx.doi.org/10.1016/j.rico.2023.100350
  • Source: Computers and Operations Research. Unidade: EESC

    Subjects: BENCHMARKS, HEURÍSTICA, SEMICONDUTORES, ENGENHARIA DE PRODUÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ROLIM, Gustavo Alencar e NAGANO, Marcelo Seido e PRATA, Bruno de Athayde. Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window. Computers and Operations Research, v. 153, p. 1-18, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2023.106159. Acesso em: 28 abr. 2024.
    • APA

      Rolim, G. A., Nagano, M. S., & Prata, B. de A. (2023). Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window. Computers and Operations Research, 153, 1-18. doi:10.1016/j.cor.2023.106159
    • NLM

      Rolim GA, Nagano MS, Prata B de A. Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window [Internet]. Computers and Operations Research. 2023 ; 153 1-18.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.cor.2023.106159
    • Vancouver

      Rolim GA, Nagano MS, Prata B de A. Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window [Internet]. Computers and Operations Research. 2023 ; 153 1-18.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.cor.2023.106159
  • Source: Engineering Optimization. Unidades: EESC, IME

    Assunto: ENGENHARIA DE PRODUÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ABREU, Levi Ribeiro de et al. A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions. Engineering Optimization, v. 54, n. 9, p. 1563-1582, 2022Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2021.1957101. Acesso em: 28 abr. 2024.
    • APA

      Abreu, L. R. de, Araújo, K. A. G., Prata, B. de A., Nagano, M. S., & Moccellin, J. V. (2022). A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions. Engineering Optimization, 54( 9), 1563-1582. doi:10.1080/0305215X.2021.1957101
    • NLM

      Abreu LR de, Araújo KAG, Prata B de A, Nagano MS, Moccellin JV. A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions [Internet]. Engineering Optimization. 2022 ; 54( 9): 1563-1582.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1080/0305215X.2021.1957101
    • Vancouver

      Abreu LR de, Araújo KAG, Prata B de A, Nagano MS, Moccellin JV. A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions [Internet]. Engineering Optimization. 2022 ; 54( 9): 1563-1582.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1080/0305215X.2021.1957101
  • Source: Jurnal Optimasi Sistem Industri. Unidade: EESC

    Subjects: MÁQUINAS ELÉTRICAS, ENGENHARIA DE PRODUÇÃO

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      PRATA, Bruno de Athayde e ABREU, Levi Ribeiro de e NAGANO, Marcelo Seido. Total tardiness minimization in a single-machine with periodical resource constraints. Jurnal Optimasi Sistem Industri, v. 21, n. 2, p. 97-105, 2022Tradução . . Disponível em: http://dx.doi.org/10.25077/josi.v21.n2.p97-105.2022. Acesso em: 28 abr. 2024.
    • APA

      Prata, B. de A., Abreu, L. R. de, & Nagano, M. S. (2022). Total tardiness minimization in a single-machine with periodical resource constraints. Jurnal Optimasi Sistem Industri, 21( 2), 97-105. doi:10.25077/josi.v21.n2.p97-105.2022
    • NLM

      Prata B de A, Abreu LR de, Nagano MS. Total tardiness minimization in a single-machine with periodical resource constraints [Internet]. Jurnal Optimasi Sistem Industri. 2022 ; 21( 2): 97-105.[citado 2024 abr. 28 ] Available from: http://dx.doi.org/10.25077/josi.v21.n2.p97-105.2022
    • Vancouver

      Prata B de A, Abreu LR de, Nagano MS. Total tardiness minimization in a single-machine with periodical resource constraints [Internet]. Jurnal Optimasi Sistem Industri. 2022 ; 21( 2): 97-105.[citado 2024 abr. 28 ] Available from: http://dx.doi.org/10.25077/josi.v21.n2.p97-105.2022
  • Source: Swarm and Evolutionary Computation. Unidade: EESC

    Subjects: INDÚSTRIA FARMACÊUTICA, CONTATOS COM CLIENTES, ALGORITMOS GENÉTICOS, ENGENHARIA DE PRODUÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ABREU, Levi Ribeiro de et al. A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness. Swarm and Evolutionary Computation, v. 75, p. 1-13, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.swevo.2022.101149. Acesso em: 28 abr. 2024.
    • APA

      Abreu, L. R. de, Prata, B. de A., Gomes, A. C., Santos, S. A. B., & Nagano, M. S. (2022). A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness. Swarm and Evolutionary Computation, 75, 1-13. doi:10.1016/j.swevo.2022.101149
    • NLM

      Abreu LR de, Prata B de A, Gomes AC, Santos SAB, Nagano MS. A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness [Internet]. Swarm and Evolutionary Computation. 2022 ; 75 1-13.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.swevo.2022.101149
    • Vancouver

      Abreu LR de, Prata B de A, Gomes AC, Santos SAB, Nagano MS. A novel BRKGA for the customer order scheduling with missing operations to minimize total tardiness [Internet]. Swarm and Evolutionary Computation. 2022 ; 75 1-13.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.swevo.2022.101149
  • Source: Computers and Operations Research. Unidade: EESC

    Assunto: ENGENHARIA DE PRODUÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ABREU, Levi Ribeiro de et al. New efficient heuristics for scheduling open shops with makespan minimization. Computers and Operations Research, v. 142, p. 1-21, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2022.105744. Acesso em: 28 abr. 2024.
    • APA

      Abreu, L. R. de, Prata, B. de A., Framinan, J. M., & Nagano, M. S. (2022). New efficient heuristics for scheduling open shops with makespan minimization. Computers and Operations Research, 142, 1-21. doi:10.1016/j.cor.2022.105744
    • NLM

      Abreu LR de, Prata B de A, Framinan JM, Nagano MS. New efficient heuristics for scheduling open shops with makespan minimization [Internet]. Computers and Operations Research. 2022 ; 142 1-21.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.cor.2022.105744
    • Vancouver

      Abreu LR de, Prata B de A, Framinan JM, Nagano MS. New efficient heuristics for scheduling open shops with makespan minimization [Internet]. Computers and Operations Research. 2022 ; 142 1-21.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1016/j.cor.2022.105744
  • Source: Engineering Optimization. Unidade: EESC

    Subjects: PROGRAMAÇÃO DA PRODUÇÃO, SCHEDULING, ALGORITMOS DE SCHEDULING, ENGENHARIA DE PRODUÇÃO

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      PRATA, Bruno de Athayde e NAGANO, Marcelo Seido. A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness. Engineering Optimization, p. [1-15], 2022Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2022.2144274. Acesso em: 28 abr. 2024.
    • APA

      Prata, B. de A., & Nagano, M. S. (2022). A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness. Engineering Optimization, [1-15]. doi:10.1080/0305215X.2022.2144274
    • NLM

      Prata B de A, Nagano MS. A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness [Internet]. Engineering Optimization. 2022 ; [1-15].[citado 2024 abr. 28 ] Available from: https://doi.org/10.1080/0305215X.2022.2144274
    • Vancouver

      Prata B de A, Nagano MS. A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness [Internet]. Engineering Optimization. 2022 ; [1-15].[citado 2024 abr. 28 ] Available from: https://doi.org/10.1080/0305215X.2022.2144274
  • Source: Arabian Journal for Science and Engineering. Unidade: EESC

    Subjects: HEURÍSTICA, PROGRAMAÇÃO DA PRODUÇÃO, ENGENHARIA DE PRODUÇÃO

    PrivadoAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      ROLIM, Gustavo Alencar e NAGANO, Marcelo Seido e PRATA, Bruno de Athayde. Effective heuristics and an iterated greedy algorithm to schedule identical parallel machines subject to common restrictive due windows. Arabian Journal for Science and Engineering, p. 1-15, 2021Tradução . . Disponível em: https://doi.org/10.1007/s13369-021-06244-9. Acesso em: 28 abr. 2024.
    • APA

      Rolim, G. A., Nagano, M. S., & Prata, B. de A. (2021). Effective heuristics and an iterated greedy algorithm to schedule identical parallel machines subject to common restrictive due windows. Arabian Journal for Science and Engineering, 1-15. doi:10.1007/s13369-021-06244-9
    • NLM

      Rolim GA, Nagano MS, Prata B de A. Effective heuristics and an iterated greedy algorithm to schedule identical parallel machines subject to common restrictive due windows [Internet]. Arabian Journal for Science and Engineering. 2021 ; 1-15.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1007/s13369-021-06244-9
    • Vancouver

      Rolim GA, Nagano MS, Prata B de A. Effective heuristics and an iterated greedy algorithm to schedule identical parallel machines subject to common restrictive due windows [Internet]. Arabian Journal for Science and Engineering. 2021 ; 1-15.[citado 2024 abr. 28 ] Available from: https://doi.org/10.1007/s13369-021-06244-9
  • Source: Journal of the Brazilian Society of Mechanical Sciences and Engineering. Unidade: EESC

    Subjects: PROGRAMAÇÃO DA PRODUÇÃO, ALGORITMOS DE SCHEDULING, SISTEMAS DE PRODUÇÃO

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
    • ABNT

      MOCCELLIN, João Vitor et al. Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times. Journal of the Brazilian Society of Mechanical Sciences and Engineering, v. 40, n. 1, 2018Tradução . . Disponível em: https://doi.org/10.1007/s40430-018-0980-4. Acesso em: 28 abr. 2024.
    • APA

      Moccellin, J. V., Nagano, M. S., Pitombeira Neto, A. R., & Prata, B. de A. (2018). Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times. Journal of the Brazilian Society of Mechanical Sciences and Engineering, 40( 1). doi:10.1007/s40430-018-0980-4
    • NLM

      Moccellin JV, Nagano MS, Pitombeira Neto AR, Prata B de A. Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times [Internet]. Journal of the Brazilian Society of Mechanical Sciences and Engineering. 2018 ; 40( 1):[citado 2024 abr. 28 ] Available from: https://doi.org/10.1007/s40430-018-0980-4
    • Vancouver

      Moccellin JV, Nagano MS, Pitombeira Neto AR, Prata B de A. Heuristic algorithms for scheduling hybrid flow shops with machine blocking and setup times [Internet]. Journal of the Brazilian Society of Mechanical Sciences and Engineering. 2018 ; 40( 1):[citado 2024 abr. 28 ] Available from: https://doi.org/10.1007/s40430-018-0980-4

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2024